Bourgain’s analytic projection revisited

Random Projection Trees Revisited

The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTREE-MAX and the RPTREE-MEAN data structures. Our result for RPTREE-MAX gives a nearoptimal bound on the number of levels required by this data structure to reduce the size of it...

Projection Pushing Revisited

The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach to join-query optimization is cost based, which requires developing a cost model, assigning an estimated cost to each queryprocessing plan, and searching in the space of all plans for a plan of minimal cost. Two other ...

Analytic Narratives Revisited

Factor Analysis and Nuisance Attribute Projection Revisited

In the paper Factor Analysis (FA) and Nuisance Attribute Projection (NAP) are reviewed, analyzed and compared. Since nowadays FA become a part of most state-of-the-art recognition systems (used e.g. in the concept of i-vectors or PLDA models) it is of relevance to examine different insights into the problem. NAP was chosen as a counterpart to FA as an advanced PCA like method often utilized in ...

Polynomial and Analytic Functors and Monads, revisited

We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.